Optimal network locality in distributed virtualized data-centers
نویسندگان
چکیده
Cost efficiency is a key aspect in deploying distributed service in networks within decentralized service delivery architectures. In this paper, we address this aspect from an optimization and algorithmic standpoint. The research deals with the placement of service components to network sites, where the performance metric is the cost for acquiring components between the sites. The resulting optimization problem, which we refer to as the k-Component Multisite Placement Problem, is applicable to service distribution in a wide range of communication networking scenarios. We provide a theoretical analysis of the problem’s computational complexity, and develop an integer programming model for providing reference results for performance benchmarking. On the algorithmic side, we present four approaches: an algorithm with approximation guarantee and three heuristics algorithms. The first heuristic is derived from graph theory on domatic partition. The second heuristic, built on intuition, admits distributed computation. The third heuristic emphasizes on fairness in cost distribution among the sites. We report simulation results for sets of networks where cost is represented by round-trip time (RTT) originating from real measurements. For small networks, the integer model is used to study algorithm performance in terms of optimality. Large networks are used to compare the al∗Corresponding author The work of this author is supported by CENIIT, Linköping University, Sweden The work of this author is supported by Vipeer project and Agence Nationale de la Recherche, France Preprint submitted to Elsevier February 11, 2011 gorithms relatively to each other. Among the algorithms, the heuristic based on intuition has close-to-optimal performance, and the fairness heuristic achieves a good balance between single-site cost and the overall one. In addition, the experiments demonstrate the significance of optimization for cost reduction in comparison to a the random allocation strategy.
منابع مشابه
Fuzzy Dynamic Load Balancing in Virtualized Data Centers of SaaS Cloud Provider
Cloud computing provides a robust infrastructure that can facilitate computing power as a utility service. All the virtualized services are made available to end users in a pay-as-you-go basis. Serving user requests using distributed network of Virtualized Data Centers is a challenging task as response time increases significantly without a proper load balancing strategy. As the parameters invo...
متن کاملDAL: A Locality-Optimizing Distributed Shared Memory System
Latency-sensitive applications like virtualized telecom and industrial IoT systems require a service for ultrafast state externalization to become cloud-native. In this paper we propose a distributed shared memory system, called DAL, which achieves the lowest possible latency by transparently co-locating individual data items with applications working on them. Upon changes in data access patter...
متن کاملImproving Map Reduce Performance in Heterogeneous Distributed System using HDFS Environment-A Review
Hadoop is a Java-based programming framework which supports for storing and processing big data in a distributed computing environment. It is using HDFS for data storing and using Map Reduce to processing that data. Map Reduce has become an important distributed processing model for large-scale data-intensive applications like data mining and web indexing. Map Reduce is widely used for short jo...
متن کاملPower Consumption Evaluation of Distributed Computing Network Considering Traffic Locality
When computing resources are consolidated in a few huge data centers, a massive amount of data is transferred to each data center over a wide area network (WAN). This results in increased power consumption in the WAN. A distributed computing network (DCN), such as a content delivery network, can reduce the traffic from/to the data center, thereby decreasing the power consumed in the WAN. In thi...
متن کاملOn the energy cost of robustness for green virtual network function placement in 5G virtualized infrastructures
Next generation 5G networks will rely on virtualized Data Centers (vDC) to host virtualized network functions on commodity servers. Such Network Function Virtualization (NFV) will lead to significant savings in terms of infrastructure cost and reduced management complexity. However, green strategies for networking and computing inside data centers, such as server consolidation or energy aware r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computer Communications
دوره 34 شماره
صفحات -
تاریخ انتشار 2011